On Two Strong Converse Theorems for Discrete Memoryless Channels
نویسندگان
چکیده
منابع مشابه
On Two Strong Converse Theorems for Stationary Discrete Memoryless Channels
In 1973, Arimoto proved the strong converse theorem for the discrete memoryless channels stating that when transmission rate R is above channel capacity C, the error probability of decoding goes to one as the block length n of code word tends to infinity. He proved the theorem by deriving the exponent function of error probability of correct decoding that is positive if and only if R > C. Subse...
متن کاملOn the Outage Theorem and its Converse for Discrete Memoryless Channels
We prove both the outage theorem and its converse for block fading discrete memoryless channel. If Pout is the outage probability for the rate R, then any transmission rate below R, together with any average error probability greater than Pout is achievable. Conversely, for any code with rate slightly greater than R, the error probability is greater than any number smaller than Pout, for large ...
متن کاملStrong Converse for Discrete Memoryless Networks with Tight Cut-Set Bounds
This paper proves the strong converse for any discrete memoryless network (DMN) with tight cut-set bound, i.e., whose cut-set bound is achievable. Our result implies that for any DMN with tight cut-set bound and any fixed rate tuple that resides outside the capacity region, the average error probabilities of any sequence of length-n codes operated at the rate tuple must tend to 1 as n grows. Th...
متن کاملTheory : Coding Theorems for Discrete Memoryless Systems
The modern study of transmission and storage of information through noisy communication channels goes back to Claude E. Shannon [4]. It is very rare that an intellectual discipline is initiated from scratch, and its framework fully given, as well as its many basic theorems proven by the initiator–but that’s exactly what Shannon did. This has made Shannon a very tough act to follow. By its natur...
متن کاملNew Strong Converse for Asymmetric Broadcast Channels
We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2015
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e98.a.2471